package cn.kgc.jihe.LinkedList01;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.List;

//第2题:已知数组存放一批QQ号码，QQ号码最长为11位，最短为5位String[] strs = {"12345","67891","12347809933","98765432102","67891","12347809933"}。
//将该数组里面的所有qq号都存放在LinkedList中，将list中重复元素删除，将list中所有元素分别用迭代器和增强for循环打印出来。
public class QQ {
    public static void main(String[] args) {
        String[] strs = {"12345","67891","12347809933","98765432102","67891","12347809933"};
        List<String>list=new LinkedList<>();
        for (int i=0;i <strs.length;i++){
                 list.add(strs[i]);
        }
        int index=-1;
        for (int i = 0; i <list.size() ; i++) {
            for (int j = i+1; j <list.size() ; j++) {
                if (list.get(i).equals(list.get(j))){
                         list.remove(j);
                }
            } 
        }

        for (String s: list){
            System.out.println(s+" ");
        }
        System.out.println(".............................................................................");
        Iterator<String> it =list.iterator();
        while (it.hasNext()){
            String s=it.next();
            System.out.println(s+" ");
        }
    }

}
